Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer

The optimal allocation of a chain-like task system on a chain-like network computers has been studied in a number of papers 1]]2]]3]]4]. The best known algorithm has a time complexity of O((m 0 ? n) 2 n) if m ? n = O(p log n); otherwise O(m 0 log m 0 + m 0 (m 0 ? n)) where m 0 and n denote the number of un-mergeable modules and the number of processors respectivelyy4]. The space complexity of Hsu's algorithm and Young and Chan's algorithm are O((m 0 ? n)n) and O(m 0 (m 0 ? n)) respectively. In this paper, we generalize the decision algorithm discussed in 4] and propose two algorithms for the optimization problem based on the generalized decision test. The rst algorithm gives an optimal schedule in O(m 02) time. For the second one, the chain-like task system is divided into two categories, dominated and non-dominated task system. A dominated task system can be solved by an asymptotically optimal algorithm in O(m 0) time. For a non-dominated task system, the worst case time complexity is O(m 0 n log(m 0 ? n)). This is asymptotically the best algorithm if m 0 ?n = !(n). This algorithm has an eecient average case time complexity of O(m 0 log m 0) which is better than all existing algorithms except m 0 ? n = o(p log n). The space complexity of our algorithm is O(m 0) which is better than that of Young and Chan's or Hsu's algorithm. Furthermore, the optimal schedules obtained by using all these algorithms share a common property that the minimal number of processors is always used so that they are the optimally load balanced optimal schedules.